Some Theoretical Links Between Shortest Path Filters and Minimum Spanning Tree Filters
نویسندگان
چکیده
منابع مشابه
On the Shortest Path and the Minimum Spanning Tree Problems
2005A7TS183P, in partial fulfillment of the requirements for BITS C421T Thesis, embodies the work done by him under my supervision. Acknowledgements I am extremely grateful to my supervisor, Kiran D.C. for his unstinting help throughout the course of my thesis work. I especially wish to thank him for allowing me to work with a great deal of freedom, and for guiding and supporting me in my other...
متن کاملRectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
We consider a setting where we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp , p = {p1, . . . , pn}, where the cost of (Ri, Rj) ∈ E is the distance between pi and pj . The Shortest Path Problem with Neighborhoods asks, for given Rs and Rt, to find a placement p ...
متن کاملeCOMPASS – TR – 046 Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
We study the geometric shortest path and the minimum spanning tree problem with neighborhoods in the L1 metric. In this setting, we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp, p = {p1, . . . , pn}, where the cost of an edge is the distance between the points....
متن کاملAutomatic Horizon Picking in 3D Seismic Data Using Optical Filters and Minimum Spanning Tree (Patent Pending)
Horizon picking in 3D seismic data is a very challenging problem. The difficulty for automatic horizon extraction exists at least in two fold: (1) the selection of picks in a trace usually ignores lateral continuity, and (2) the trace traversal order can result in significantly different horizons so that the resulting picks in the same horizon often conflict with each other. In this paper, a pa...
متن کاملSemi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices
At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Imaging and Vision
سال: 2019
ISSN: 0924-9907,1573-7683
DOI: 10.1007/s10851-018-0866-1